A comparison theorem for eigenvalues of the covariant Laplacian

Laplacian eigenvalues and optimality: II. The Laplacian of a graph

Eigenvalues of the normalized Laplacian

A graph can be associated with a matrix in several ways. For instance, by associating the vertices of the graph to the rows/columns and then using 1 to indicate an edge and 0 otherwise we get the adjacency matrix A. The combinatorial Laplacian matrix is defined by L = D − A where D is a diagonal matrix with diagonal entries the degrees and A is again the adjacency matrix. Both of these matrices...

Eigenvalues of the Conformal Laplacian

We introduce a differential topological invariant for compact differentiable manifolds by counting the small eigenvalues of the Conformal Laplace operator. This invariant vanishes if and only if the manifold has a metric of positive scalar curvature. We show that the invariant does not increase under surgery of codimension at least three and we give lower and upper bounds in terms of the α-genus.

Bounds for Laplacian Graph Eigenvalues

Let G be a connected simple graph whose Laplacian eigenvalues are 0 = μn (G) μn−1 (G) · · · μ1 (G) . In this paper, we establish some upper and lower bounds for the algebraic connectivity and the largest Laplacian eigenvalue of G . Mathematics subject classification (2010): 05C50, 15A18.

investigating the feasibility of a proposed model for geometric design of deployable arch structures

deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...